"Different" as a Restriction on Skolem Functions

Tests as Skolem Functions

Skolem Functions for DQBF

We consider the problem of computing Skolem functions for satisfied dependency quantified Boolean formulas (DQBFs). We show how Skolem functions can be obtained from an elimination-based DQBF solver and how to take preprocessing steps into account. The size of the Skolem functions is optimized by don’t-care minimization using Craig interpolants and rewriting techniques. Experiments with our DQB...

Skolem Functions and Elementary Extensions

In [4] Payne constructed such a pair of uncountable models for an uncountable language. Knight [1] announced that the language could be countable and presented her construction in [3] together with other examples one of which is a " nonSkolemizable elementary triple " of countable structures for a countable language. Payne's, Knight's and the present construction all seem to use rather differen...

On Definable Skolem Functions in Weakly O-Minimal nonvaluational Structures

We prove that all known examples of weakly o-minimal non-valuational structures have no de nable Skolem functions. We show, however, that such structures eliminate imaginaries up to de nable families of cuts. Along the way we give some new examples of weakly ominimal non-valuational structures.

Adding Skolem functions to simple theories

We examine the conditions under which we can keep simplicity or categoricity after adding a Skolem function to the theory. AMS classification: 03C45 , 03C50